Approximating Gradients with Continuous Piecewise Polynomial Functions
نویسندگان
چکیده
منابع مشابه
Approximating Piecewise-Smooth Functions
We consider the possibility of using locally supported quasi-interpolation operators for the approximation of univariate non-smooth functions. In such a case one usually expects the rate of approximation to be lower than that of smooth functions. It is shown in this paper that prior knowledge of the type of ’singularity’ of the function can be used to regain the full approximation power of the ...
متن کاملA canonical form for the continuous piecewise polynomial functions
We present in this paper a canonical form for the elements in the ring of continuous piecewise polynomial functions. This new representation is based on the use of a particular class of functions {Ci(P ) : P ∈ Q[x], i = 0, . . . , deg(P )} defined by Ci(P )(x) = { 0 if x ≤ α P (x) if x ≥ α where α is the i-th real root of the polynomial P . These functions will allow us to represent and manipul...
متن کاملAn algorithm for approximating piecewise linear concave functions from sample gradients
An e ective algorithm for solving stochastic resource allocation problems is to build piecewise linear, concave approximations of the recourse function based on sample gradient information. Algorithms based on this approach are proving useful in application areas such as the newsvendor problem, physical distribution and eet management. These algorithms require the adaptive estimation of the app...
متن کاملFitting piecewise linear continuous functions
We consider the problem of fitting a continuous piecewise linear function to a finite set of data points, modeled as a mathematical program with convex objective. We review some fitting problems that can be modeled as convex programs, and then introduce mixed-binary generalizations that allow variability in the regions defining the best-fit function’s domain. We also study the additional constr...
متن کاملC-continuous surface reconstruction with piecewise polynomial patches
In this report we describe a new method for generating a smooth surface that approximates a given manifold triangulation with arbitrary topology. At first we treat this problem in an axiomatic approach that does not depend on a specific surface type and derive a set of necessary conditions that guarantee the C2-continuity of the result. Then we apply these conditions and develop an algorithm fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2015
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-015-9262-z